منابع مشابه
on distinguishability versus indistinguishability
The following comments are from the book Quantum Mechanics by Claude CohenTannoudji, Bernard Diu, and Franck Laloë. Identical particles: definition Two particles are said to be identical if all their intrinsic properties (mass, spin, charge, etc.) are exactly the same: no experiment can distinguish one from the other. Thus, all electrons in the universe are identical, as are all the protons and...
متن کاملFrom Absolute Distinguishability to Positive Distinguishability
We study methods of converting algorithms that distinguish pairs of distributions with a gap that has an absolute value that is noticeable into corresponding algorithms in which the gap is always positive (and noticeable). Our focus is on designing algorithms that, in addition to the tested string, obtain a fixed number of samples from each distribution. Needless to say, such algorithms can not...
متن کاملWigner-Araki-Yanase theorem on Distinguishability
Takayuki Miyadera ∗ and Hideki Imai ∗,† ∗ Research Center for Information Security (RCIS), National Institute of Advanced Industrial Science and Technology (AIST). Daibiru building 1102, Sotokanda, Chiyoda-ku, Tokyo, 101-0021, Japan. (e-mail: [email protected]) † Graduate School of Science and Engineering Course of Electrical, Electronic, and Communication Engineering, Chuo Universit...
متن کاملOn Distinguishability of Black Hole Microstates
We use the Holevo information to estimate distinguishability of microstates of a black hole in anti-de Sitter space by measurements one can perform on a subregion of a Cauchy surface of the dual conformal field theory. We find that microstates are not distinguishable at all until the subregion reaches a certain size and that perfect distinguishability can be achieved before the subregion covers...
متن کاملTight Bounds on Profile Redundancy and Distinguishability
The minimax KL-divergence of any distribution from all distributions in a collection P has several practical implications. In compression, it is called redundancy and represents the least additional number of bits over the entropy needed to encode the output of any distribution in P . In online estimation and learning, it is the lowest expected log-loss regret when guessing a sequence of random...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 1973
ISSN: 0090-5364
DOI: 10.1214/aos/1176342505